Efficient Hop-constrained s-t Simple Path Enumeration

Graph is a ubiquitous structure representing entities and their relationships applied in many areas such as social networks, web graphs, biological networks. One of the fundamental tasks graph analytics to investigate relations between two vertices (e.g., users, items, entities) how vertex A influences another B, or what extent B are similar each other, based on topology structure. For this purpose, we study problem hop-constrained s-t simple path enumeration paper, which aims list all paths from source s target t with hop-constraint k. We first propose polynomial delay algorithm, namely BC-DFS, barrier-based pruning technique. Then, join-oriented JOIN, designed further enhance query response time. On theoretical side, BC-DFS algorithm O(km) time per output where m number edges graph. This complexity best known result for algorithms problem. practical our comprehensive experiments 15 real-life networks demonstrate superior performance compared state-of-the-art techniques. It also reported that JOIN can significantly In diversity constraint block-oriented SCB. To speed up computation, hybrid lower bounds reverse shortest-path tree developed, SCB+. The show proposed methods improve scalability comparing baselines.